Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
291	February 3, 2009 COM S 6810 Theory of Computing Lecture 5: Polynomial Hierarchy Instructor: Rafael Pass Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-04 17:20:26 Computational complexity theory Complexity classes Theory of computation Polynomial hierarchy P versus NP problem IP True quantified Boolean formula NP PP Oracle machine PSPACE-complete Polynomial-time reduction
292	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-10-02 11:19:31 NP-complete problems Graph Graph theory Matching Cycle Hamiltonian path Spanning tree
293	Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler Add to Reading List Source URL: htor.inf.ethz.ch Language: English - Date: 2015-09-14 07:27:20 Graph theory Mathematics Computing Concurrency control Transaction processing NP-complete problems Computer memory Transactional memory Vertex Breadth-first search Graph coloring Transactional Synchronization Extensions
294	Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood. Add to Reading List Source URL: www.ulb.ac.be Language: English - Date: 2011-02-08 09:21:41 Graph theory Bipartite graphs Geometric spanner Shortest path problem Planar graph Tree Delaunay triangulation NP-complete problems Planar separator theorem Trapezoid graph
295	D Complete List of Publications by Members of EXCS 2003–Date Listed below are the pre-refereed journal and conference articles, monographs, dissertations and edited volumes by the members of the consortium (the four t Add to Reading List Source URL: www.cs.ioc.ee Language: English - Date: 2008-03-28 08:28:36 Software engineering Programming language theory ALGOL 68 Computing
296	WeilSchaudt_DeltaChi_GaC.dvi Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-06-05 05:09:32 Graph theory Graph coloring NP-complete problems Graph operations Perfect graph theorem Line graph Perfect graph Clique Bipartite graph Triangle-free graph Strong perfect graph theorem Graph minor
297	How to Grow More Pairs: Suggesting Review Targets For Comparison-Friendly Review Ecosystems James Cook ∗ UC Berkeley Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Mathematics NP-complete problems Combinatorics Discrete mathematics Greedy algorithm Matroid theory Set cover problem Algorithm Combinatorial optimization
298	Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu§ , Ben Y. Zhao and Haitao Zheng Department of Computer Science, U. C. Santa Barbara, USA § Tsinghua University Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2013-03-23 01:40:10 Graph theory NP-complete problems Graph coloring Graph Global Positioning System Random graph
299	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-09 05:54:36 Graph theory Mathematics NP-complete problems Graph coloring Hypergraph Dominating set Ear decomposition Graph Line graph Modular decomposition
300	Sound and Complete Flow Typing with Unions, Intersections and Negations David J. Pearce Victoria University of Wellington Wellington, New Zealand {djp}@ecs.vuw.ac.nz Add to Reading List Source URL: homepages.ecs.vuw.ac.nz Language: English - Date: 2012-11-09 02:30:24 Type theory Data types Functional languages Object-oriented programming Type systems Subtyping Whiley OCaml ALGOL 68 Type conversion Const ML

UPDATE